Codification schemes and finite automata
نویسندگان
چکیده
منابع مشابه
Codification schemes and finite automata
This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games played by boundedly rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman’s (1998) work on finitely repeated games played b...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملGenerative Capacities of Cellular Automata Codification for Evolution of NN Codification
Automatic methods for designing artificial neural nets are desired to avoid the laborious and erratically human expert’s job. Evolutionary computation has been used as a search technique to find appropriate NN architectures. Direct and indirect encoding methods are used to codify the net architecture into the chromosome. A reformulation of an indirect encoding method, based on two bi-dimensiona...
متن کاملNonstandard finite difference schemes for differential equations
In this paper, the reorganization of the denominator of the discrete derivative and nonlocal approximation of nonlinear terms are used in the design of nonstandard finite difference schemes (NSFDs). Numerical examples confirming then efficiency of schemes, for some differential equations are provided. In order to illustrate the accuracy of the new NSFDs, the numerical results are compared with ...
متن کاملLinear Cellular Automata and Finite Automata
Linear cellular automata have a canonical representation in terms of labeled de Bruijn graphs. We will show that these graphs, construed as semiautomata, provide a natural setting for the study of cellular automata. For example, we give a simple algorithm to determine reversibility and surjectivity of the global maps. We also comment on Wolfram’s question about the growth rates of the minimal f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Social Sciences
سال: 2008
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2008.01.007